On classifying finite edge colored graphs with two transitive automorphism groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On classifying finite edge colored graphs with two transitive automorphism groups

This paper classifies all finite edge colored graphs with doubly transitive automorphism groups. This result generalizes the classification of doubly transitive balanced incomplete block designs with 1 and doubly transitive one-factorizations of complete graphs. It also provides a classification of all doubly transitive symmetric association schemes. The classification of finite simple groups i...

متن کامل

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

متن کامل

Edge colored complete bipartite graphs with trivial automorphism groups

We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph Ks,t which admits only the identity automorphism. In particular, we show that for a given s with a few small exceptions, there is such a coloring with c colors if and only r ≤ t ≤ cs − r where r = blogc(s − 1)c + 1 if s ≤ c or if s ≥ c + 1 and s ≥ c1+blogc(s−1)c − blogcblogc(s− 1)cc and...

متن کامل

The automorphism groups of non-edge-transitive rose window graphs

In this paper, we will determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this will complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we deter...

متن کامل

On automorphism groups of quasiprimitive 2-arc transitive graphs

We characterize the automorphism groups of quasiprimitive 2-arc-transitive graphs of twisted wreath product type. This is a partial solution for a problem of Praeger regarding quasiprimitive 2-arc transitive graphs. The solution stimulates several further research problems regarding automorphism groups of edge-transitive Cayley graphs and digraphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2004

ISSN: 0095-8956

DOI: 10.1016/s0095-8956(03)00079-0